Extracting Boolean rules from CA patterns
نویسندگان
چکیده
A multiobjective genetic algorithm (GA) is introduced to identify both the neighborhood and the rule set in the form of a parsimonious Boolean expression for both one- and two-dimensional cellular automata (CA). Simulation results illustrate that the new algorithm performs well even when the patterns are corrupted by static and dynamic noise.
منابع مشابه
Identification of the neighborhood and CA rules from spatio-temporal CA patterns
Extracting the rules from spatio-temporal patterns generated by the evolution of cellular automata (CA) usually produces a CA rule table without providing a clear understanding of the structure of the neighborhood or the CA rule. In this paper, a new identification method based on using a modified orthogonal least squares or CA-OLS algorithm to detect the neighborhood structure and the underlyi...
متن کاملThe Use of Bernoulli Mixture Models for Identifying Corners of a Hypercube and Extracting Boolean Rules From Data
This paper describes the use of Bernoulli mixture models for extracting boolean rules from data. Bernoulli mixtures identify high data density areas on the corners of a hypercube. One corner represents a conjunction of literals in a boolean clause and the set of all identified corners, of the hypercube, indicates disjuncts of clauses to form a rule. Further class labels can be used to select fe...
متن کاملExtracting the Hidden Patterns Affecting Mental Health through Data Mining Techniques
Background and Objective: This study was conducted to shed light on the hidden relationships, trends, and patterns of the teenagers’ mental health dataset based on data mining techniques. Materials and Methods: The proposed method has four parts as follows: data preprocessing, data cleaning, target class selection, and extracting rules. The classes included inappropriate, moderate, and accepta...
متن کاملOn the inherent competition between valid and spurious inductive inferences in Boolean data
Inductive inference is the process of extracting general rules from specific observations. This problem also arises in the analysis of biological networks, such as genetic regulatory networks, where the interactions are complex and the observations are incomplete. A typical task in these problems is to extract general interaction rules as combinations of Boolean covariates, that explain a measu...
متن کاملPhase Transitions in Possible Dynamics of Cellular and Graph Automata Models of Sparsely Interconnected Multi-Agent Systems
We are interested in Communicating Finite State Machine (CFSM) based models of large-scale multi-agent systems and their emerging behavior. CFSM-based models are suitable for studying large ensembles of simple reactive agents, and collective dynamics of such ensembles. In this paper, we focus on the asymptotic dynamics of a class of the classical (finite) Cellular Automata (CA) and more general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society
دوره 30 4 شماره
صفحات -
تاریخ انتشار 2000